Papers with Knowledge Base Completion
Recurrent One-Hop Predictions for Reasoning over Knowledge Graphs (C18-1)
Copied to clipboard
| Challenge: | Large scale knowledge graphs (KGs) such as Freebase are generally incomplete. |
| Approach: | They propose a model that predicts entities at each step of mh-KB paths . the model is based on recurrent neural networks and vector representations of entities and relations . |
| Outcome: | The proposed models show state-of-the-art for two important multi-hop KG reasoning tasks. |
Revisiting the Task of Scoring Open IE Relations (L18-1)
Copied to clipboard
| Challenge: | Recent Open Information Extraction systems allow us to extract ever larger (yet incomplete) open-domain Knowledge Bases from text. |
| Approach: | They propose a baseline model which gives competitive results in a previously defined protocol and provides an independent source of signal to judge arbitrary fact plausibility. |
| Outcome: | The proposed model gives competitive results in the previously defined protocol and provides an independent source of signal to judge arbitrary fact plausibility. |